Generalized Pell numbers, graph representations and independent sets
نویسندگان
چکیده
In this paper we generalize the Pell numbers and the Pell-Lucas numbers and next we give their graph representations. We shall show that the generalized Pell numbers and the generalized Pell-Lucas numbers are equal to the total number of independent sets in special graphs.
منابع مشابه
The generalized order-k Fibonacci–Pell sequence by matrix methods
In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, thenwe define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix me...
متن کاملOn The Usual Fibonacci and Generalized Order-k Pell Numbers
In this paper, we give some relations involving the usual Fibonacci and generalized order-k Pell numbers. These relations show that the generalized order-k Pell numbers can be expressed as the summation of the usual Fibonacci numbers. We nd families of Hessenberg matrices such that the permanents of these matrices are the usual Fibonacci numbers, F2i 1; and their sums. Also extending these mat...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملTHE GENERALIZED BINET FORMULA, REPRESENTATION AND SUMS OF THE GENERALIZED ORDER-k PELL NUMBERS
In this paper we give a new generalization of the Pell numbers in matrix representation. Also we extend the matrix representation and we show that the sums of the generalized order-k Pell numbers could be derived directly using this representation. Further we present some identities, the generalized Binet formula and combinatorial representation of the generalized order-k Pell numbers.
متن کاملOn the computing of the generalized order-k Pell numbers in log time
In this paper, we consider the generalized order-k Pell numbers and present an algorithm for computing the sums of the generalized order-k Pell numbers, as well as the Pell numbers themselves. The theoretical basis of using a matrix method for deriving the algorithm is also discussed. 2006 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 46 شماره
صفحات -
تاریخ انتشار 2010